Location:
Search - 2d fft
Search list
Description: matlab图像处理的一些命令,如applylut,提取二进制图像的轮廓的bwmorph,识别强度图像中的边界的edge,进行二维快速傅里叶变换的fft2等等.-Matlab image processing some orders, such as applylut. extract the binary image of the contours of the bwmorph identify intensity image of the border edge, 2D Fast Fourier Transform fft2 and so on.
Platform: |
Size: 427008 |
Author: ruan pingfan |
Hits:
Description: 将一副256*256的灰度图像分成8*8的小图像块，然后进行dct变换-Will be a 256* 256 gray image is divided into 8* 8 small image blocks, and then proceed to DCT transform
Platform: |
Size: 389120 |
Author: 笨笨 |
Hits:
Description: 多维傅里叶变换，二维DFT快速算法，共分五部--三：二维实序2D-DFT列行列算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 3: two-dimensional real column ordinal ranks of 2D-DFT algorithm for
Platform: |
Size: 3072 |
Author: jet ju |
Hits:
Description: - conv2fft.m ---> M-file for 2D FFT-based convolution
- convfft.m ---> M-file for 1D FFT-based convolution-- conv2fft.m ---> M-file for 2D FFT-based convolution
- convfft.m ---> M-file for 1D FFT-based convolution
Platform: |
Size: 3072 |
Author: 邢砚 |
Hits:
Description: Presently FFT usage in GPS receivers has been a
topic of extensive study and many improved FFT-based
acquisition methods with averaging correlation
technique also have emerged. Although averaging
arithmetic can reduce the instant processing points of
FFT/IFFT, their noise performance is not promising. In
this paper a novel compress-sampling algorithm for
FFT-base GPS signal acquisition method is proposed.
It not only diminishes the size of FFT/IFFT core but
also enhances the noise immunity of receiver with its
“redundancy” structure. Simulation results of Matlab
testify that the computational complexity of the novel
algorithm has been efficiently suppressed to only
0.93 over the 2D search method in time domain. At
the same time the lower amplitude threshold obtained
from the novel method gets a lower false alarm
probability comparing with the direct DFT algorithm
with no compression. The noise immunity is enhanced-Presently FFT usage in GPS receivers has been a
topic of extensive study and many improved FFT-based
acquisition methods with averaging correlation
technique also have emerged. Although averaging
arithmetic can reduce the instant processing points of
FFT/IFFT, their noise performance is not promising. In
this paper a novel compress-sampling algorithm for
FFT-base GPS signal acquisition method is proposed.
It not only diminishes the size of FFT/IFFT core but
also enhances the noise immunity of receiver with its
“redundancy” structure. Simulation results of Matlab
testify that the computational complexity of the novel
algorithm has been efficiently suppressed to only
0.93 over the 2D search method in time domain. At
the same time the lower amplitude threshold obtained
from the novel method gets a lower false alarm
probability comparing with the direct DFT algorithm
with no compression. The noise immunity is enhanced
Platform: |
Size: 254976 |
Author: zohreh |
Hits:
Description: Presently FFT usage in GPS receivers has been a
topic of extensive study and many improved FFT-based
acquisition methods with averaging correlation
technique also have emerged. Although averaging
arithmetic can reduce the instant processing points of
FFT/IFFT, their noise performance is not promising. In
this paper a novel compress-sampling algorithm for
FFT-base GPS signal acquisition method is proposed.
It not only diminishes the size of FFT/IFFT core but
also enhances the noise immunity of receiver with its
“redundancy” structure. Simulation results of Matlab
testify that the computational complexity of the novel
algorithm has been efficiently suppressed to only
0.93 over the 2D search method in time domain. At
the same time the lower amplitude threshold obtained
from the novel method gets a lower false alarm
probability comparing with the direct DFT algorithm
with no compression. The noise immunity is enhanced-Presently FFT usage in GPS receivers has been a
topic of extensive study and many improved FFT-based
acquisition methods with averaging correlation
technique also have emerged. Although averaging
arithmetic can reduce the instant processing points of
FFT/IFFT, their noise performance is not promising. In
this paper a novel compress-sampling algorithm for
FFT-base GPS signal acquisition method is proposed.
It not only diminishes the size of FFT/IFFT core but
also enhances the noise immunity of receiver with its
“redundancy” structure. Simulation results of Matlab
testify that the computational complexity of the novel
algorithm has been efficiently suppressed to only
0.93 over the 2D search method in time domain. At
the same time the lower amplitude threshold obtained
from the novel method gets a lower false alarm
probability comparing with the direct DFT algorithm
with no compression. The noise immunity is enhanced
Platform: |
Size: 87040 |
Author: zohreh |
Hits:
Description: 用C++编写的实现二维FFT变换的写程序。-Written in C++, to achieve two-dimensional FFT transform to write programs.
Platform: |
Size: 2048 |
Author: choushi |
Hits:
Description: 这是一个简单的FFT为无电位1 +1 +1 Ð 薛定谔方程的光束传播方法。如果该软件灵活，允许引入的术语（如果是极少数需要包括色散效应高阶导数）。例如，如果一个人渴望解决的一个方程的形式：
（四/ dz的+ Ð ^ 2/dx ^ 2 - 0.25 * Ð ^ 3/dx ^ 3）== 0 Ÿ
它可以解决使用以下代码：
Ž = linspace（0,1,512）
x = linspace（-5,5,1024）
psi0 =进出口（- x的。^ 2）
Ð = D_lateral1D（十，2）-0.25 * D_lateral1D（十，3）
字段= LinearBPM（psi0，有D，Z）
凡D_lateral1D是一个函数，提供“取代”的微分算子。
这个函数是在一个非线性的BPM，我曾对（分步，谱方法等），将提交给我，当我完成他们的文件和组织功能更复杂的设置非常初期阶段。
-This is a simple FFT based beam propagation method for potential-free 1+1+1D Schrodinger equation. The software if flexible and allows to introduce high-order derivatives in the term (very handful if is needed to include dispersion effects). For example, if one desires to solve an equation in the form:
(d/dz+ d^2/dx^2- 0.25*d^3/dx^3)Y == 0
It can be solved using the following code:
z=linspace(0,1,512)
x=linspace(-5,5,1024)
psi0=exp(-x.^2)
D=D_lateral1D(x,2)-0.25*D_lateral1D(x,3)
field=LinearBPM(psi0,D,z)
Where D_lateral1D is a provided function that "replaces" the derivative operator.
This function is a very early stage in a more complex set of non-linear BPM functions that I have made (split-step, spectral methods, etc.) and I will submit them when I finish their documentation and organization.
Sorry for my English, I m eager for your comments.
Platform: |
Size: 2048 |
Author: zhou |
Hits:
Description: 一系列展示图像压缩技术的源代码。包括有：使用块截断编码的图像压缩(Block Truncation)、基于高斯金字塔变换的图像压缩(Gaussian Pyramids)、基于离散余弦变换对图像压缩(Discrete Cosine Transform)、基于奇异值分解(SVD)的图像压缩(Singular Value Decomposition)。给出的代码还可以用于2D图像噪声消除。-Image Compression
A collection of simple routines for image compression using different techniques.
BTCODE:
Image compression Using Block Truncation Coding.
PYRAMID:
Image compression based on Gaussian Pyramids.
DCTCOMPR:
Image compression based on Discrete Cosine Transform.
IMCOMPR:
Image compression based on Singular Value Decomposition.
The given codes can be also used in 2D noise suppression.
Notes:
The function "conv2fft" performs a 2D FFT-based convolution.
Type "help conv2fft" on Matlab command window for more informations.
Platform: |
Size: 56320 |
Author: 依米 |
Hits:
Description: 2维傅立叶变换方法用于分析干涉条纹，相移计算。-2D FFT for fringe annalisys
Platform: |
Size: 70656 |
Author: Gwe |
Hits:
Description: Source code of forward and backward 2D FFT with low or high frequency filter (run with pcx-file as parameter)
Platform: |
Size: 32768 |
Author: eakalinin |
Hits:
Description: 二维傅里叶变换,对图像进行二维傅里叶变换处理-Two-Dimensional Fast Fourier Transform
The purpose of this project is to develop a 2-D FFT program "package" that will be used
in several other projects that follow. Your implementation must have the capabilities to:
(a) Multiply the input image by (-1)x+y to center the transform for filtering.
(b) Multiply the resulting (complex) array by a real function (in the sense that the
the real coefficients multiply both the real and imaginary parts of the transforms).
Recall that multiplication of two images is done on pairs of corresponding elements.
(c) Compute the inverse Fourier transform.
(d) Multiply the result by (-1)x+y and take the real part.
(e) Compute the spectrum.
Platform: |
Size: 1024 |
Author: solo |
Hits:
Description: 2d FFT with DX10 (fastest fft algorithm)-2d FFT with DX10 (fastest fft algorithm)
Platform: |
Size: 6674432 |
Author: serkant |
Hits:
Description: Pass the Images Through Optics -- Use a Gaussian "Aperture Function"
This code segement can use a measured aperture function just as easily - simply replace the next five lines by "load measured_aperture" where measured_aperture is the measured function strored in ASCII and the data stored in the file measured_aperture.mat is a MATLAB .mat file that contains the matrix apfunction. (in MATLAB type "help load" for how to use load and look at the c and fortran code that shows how to read and write MATLAB .mat files).
(Note: When the Point Spread Function is Gaussian, then so is the Aperture function)
To simulate the effect of the tracker optics, each of the movie frames is now blurred using a 2-D FFT (Fast Fourier Transform). The first frame of the resulting image is shown in Figure 1.
- Pass the Images Through Optics -- Use a Gaussian "Aperture Function"
This code segement can use a measured aperture function just as easily - simply replace the next five lines by "load measured_aperture" where measured_aperture is the measured function strored in ASCII and the data stored in the file measured_aperture.mat is a MATLAB .mat file that contains the matrix apfunction. (in MATLAB type "help load" for how to use load and look at the c and fortran code that shows how to read and write MATLAB .mat files).
(Note: When the Point Spread Function is Gaussian, then so is the Aperture function)
To simulate the effect of the tracker optics, each of the movie frames is now blurred using a 2-D FFT (Fast Fourier Transform). The first frame of the resulting image is shown in Figure 1.
Platform: |
Size: 1024 |
Author: sabah_altaie |
Hits:
Description: 基于二维2D的FFT卷积分，提供给大家参考，共同学习。-2D FFT-based two-dimensional volume integral, provided for your reference, learning together.
Platform: |
Size: 2048 |
Author: hh |
Hits:
Description: 基于labwindowS cvi软件的，进行二维数组FFT运算-labwindows cvi 2d FFT
Platform: |
Size: 7168 |
Author: gzz |
Hits:
Description: 自己編寫的matlab代碼，實現fft函數及ifft函數功能-I have written matlab code to achieve the original fft function and the ifft function
Platform: |
Size: 1024 |
Author: Sherry |
Hits:
Description: VC++写的傅里叶变换，1D和2D的都有。-1DFFT 2DFFT
Platform: |
Size: 2048 |
Author: 糖糖 |
Hits:
Description: 2D图像处理的快速傅里叶变换，输入输出接口便捷-2D image processing, fast Fourier transform, and convenient input and output interfaces
Platform: |
Size: 54272 |
Author: 王伟 |
Hits:
Description: 2D FFT in matlab. inputs are original data and block size. ex) block size = [8 8]
Platform: |
Size: 231424 |
Author: nishina |
Hits: